Rendezvous scheduling in Bluetooth scatternets

نویسندگان

  • Per Johansson
  • Rohit Kapoor
  • Manthos Kazantzidis
  • Mario Gerla
چکیده

Bluetooth scatternets are formed by interconnecting Bluetooth piconets in an ad-hoc fashion and consists typically of the handheld electronic devices from one or more user(s). Thus, scatternets may be used to form and interconnect adhoc Bluetooth personal area networks (PANs). The inter-piconet Bluetooth units, i.e. the gateways interconnecting the piconets in a scatternet, need to time division multiplex their presence in each of their piconets. This requires an interpiconet scheduling (IPS) algorithm, operating in each inter-piconet unit in order to efficiently coordinate its presence with other Bluetooth units. In this paper an IPS algorithm based on periodic rendezvous points is proposed and analyzed with simulations. The algorithm is called Maximum Distance Rendezvous Point (MDRP) and utilizes the Bluetooth SNIFF functionality to establish the periodic rendezvous points between gateways and their peer nodes. The Bluetooth simulator used in the study is based on NS-2, augmented with a scatternet architecture and a Bluetooth MAC layer model. The simulations obtain results regarding TCP behavior and voice delays. The results show that TCP works well with MDRP, but the large round trip delays caused by the inter-piconet gateway nodes give a slowly growing flow control window for TCP. The latter will in particular have impact on the TCP performance in scatternets hosting “thin” (embedded) clients with limited dynamic memory capacity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dichotomized Rendezvous Algorithm for Mesh Bluetooth Scatternets

A Bluetooth scatternet is formed by sharing some nodes (bridges) among piconets in a time division multiplex basis. Effective coordination of these bridge nodes is crucial for the smooth operation of a scatternet. In this paper, a distributed, two-phase RP scheduling algorithm called Dichotomized Rendezvous Point algorithm (DRP) is presented to address this problem. DRP makes the assumption tha...

متن کامل

Modeling of Loosely Coupled Scatternets with Finite Buffers

This article deals with the performance of Bluetooth scatternets in a real-life environment where different queues are implemented with finite buffers. Finite buffer size will introduce packet blocking at different queues along the packet path, which in turn causes changes in effective traffic load as well as retransmissions and ultimately affects end-to-end packet delays. The authors assume th...

متن کامل

Locally optimal Bluetooth Scatternet formation

The Bluetooth specification defines gateway nodes so that piconets communicate among each other in a seamless ad-hoc manner, forming scatternets. The specification also defines primitives for gateway nodes to divide their time between their piconets, but the actual mechanism and algorithms that this can be accomplished is left open. The time division in gateways effectively limits the network c...

متن کامل

On the Impact of Inter- Piconet Scheduling in Bluetooth Scatternets

The current Bluetooth specification defines the notion of interconnected piconets, called scatternets, but does not define the actual mechanisms and algorithms necessary to set up and maintain them. A scatternet will typically be set up in an ad-hoc fashion to interconnect piconets. For instance, a typical personal area network (PAN) would comprise of a user’s wearable and portable electronic d...

متن کامل

Forming Scatternets from Bluetooth Personal Area Networks

There is increasing interest in wireless ad hoc networks built from portable devices equipped with short-range wireless network interfaces. This paper addresses issues related to internetworking such networks to form larger “scatternets.” Within the constraints imposed by the emerging standard Bluetooth link layer and MAC protocol, we describe an efficient online topology formation algorithm, c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002